Modeling Relational Data via Latent Factor Blockmodel

نویسندگان

  • Sheng Gao
  • Ludovic Denoyer
  • Patrick Gallinari
چکیده

In this paper we address the problem of modeling relational data, which appear in many applications such as social network analysis, recommender systems and bioinformatics. Previous studies either consider latent feature based models but disregarding local structure in the network, or focus exclusively on capturing local structure of objects based on latent blockmodels without coupling with latent characteristics of objects. To combine the benefits of the previous work, we propose a novel model that can simultaneously incorporate the effect of latent features and covariates if any, as well as the effect of latent structure that may exist in the data. To achieve this, we model the relation graph as a function of both latent feature factors and latent cluster memberships of objects to collectively discover globally predictive intrinsic properties of objects and capture latent block structure in the network to improve prediction performance. We also develop an optimization transfer algorithm based on the generalized EM-style strategy to learn the latent factors. We prove the efficacy of our proposed model through the link prediction task and cluster analysis task, and extensive experiments on the synthetic data and several real world datasets suggest that our proposed LFBM model outperforms the other state of the art approaches in the evaluated tasks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse matrix-variate Gaussian process blockmodels for network modeling

We face network data from various sources, such as protein interactions and online social networks. The network data often comprise pairwise measurements, e.g., presence or absence of links between pairs of objects. Given the data, a critical problem is to model network interactions and identify latent groups of network nodes. This problem is challenging due to many reasons. For example, the ne...

متن کامل

Sparse Matrix-Variate t Process Blockmodels

We consider the problem of modeling binary interactions in networks, such as friendship networks and protein interaction networks, and identifying latent groups in the networks. This problem is challenging due to the facts i) that the data are interdependent instead of independent, ii) that the network data are very noise (e.g., missing edges), and iii) that the network interactions are often s...

متن کامل

Mixed Membership Stochastic Blockmodels

Observations consisting of measurements on relationships for pairs of objects arise in many settings, such as protein interaction and gene regulatory networks, collections of author-recipient email, and social networks. Analyzing such data with probabilisic models can be delicate because the simple exchangeability assumptions underlying many boilerplate models no longer hold. In this paper, we ...

متن کامل

A latent factor model for highly multi-relational data

Many data such as social networks, movie preferences or knowledge bases are multi-relational, in that they describe multiple relations between entities. While there is a large body of work focused on modeling these data, modeling these multiple types of relations jointly remains challenging. Further, existing approaches tend to breakdown when the number of these types grows. In this paper, we p...

متن کامل

On Inductive Abilities of Latent Factor Models for Relational Learning

Latent factor models are increasingly popular for modeling multi-relational knowledge graphs. By their vectorial nature, it is not only hard to interpret why this class of models works so well, but also to understand where they fail and how they might be improved. We conduct an experimental survey of state-of-the-art models, not towards a purely comparative end, but as a means to get insight ab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1204.2581  شماره 

صفحات  -

تاریخ انتشار 2012